Optimal Strategy Synthesis for Request-Response Games

ar X iv : 1 40 6 . 46 48 v 1 [ cs . F L ] 1 8 Ju n 20 14 Optimal Strategy Synthesis for Request - Response Games ∗ Florian Horn

We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.

Optimal Strategy Synthesis in Request-Response Games

Time-optimal Winning Strategies in Infinite Games

Infinite Games are an important tool in the synthesis of finite-state controllers for reactive systems. The interaction between the environment and the system is modeled by a finite graph. The specification that has to be satisfied by the controlled system is translated into a winning condition on the infinite paths of the graph. Then, a winning strategy is a controller that is correct with res...

Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen: Syntheseverfahren, Optimierung und Implementierung

In this thesis we develop methods for the solution of infinite games and present implementations of corresponding algorithms in the framework of a platform for the experimental study of automata theoretic algorithms. Our focus is on games with winning conditions that express certain liveness properties. A central type of liveness requirement in applications (e.g., in controller synthesis) is th...

Time-Optimal Winning Strategies for Poset Games

We introduce a novel winning condition for infinite two-player games on graphs which extends the request-response condition and better matches concrete applications in scheduling or project planning. In a poset game, a request has to be responded by multiple events in an ordering over time that is compatible with a given partial ordering of the events. Poset games are zero-sum, but there are pl...